Theory Formation by Heuristic Search

نویسنده

  • Douglas B. Lenat
چکیده

Ahwhine h'arning can be categorized along many dimcnsiotts, an important one o/ ~hich is "degree of human guidance or forethought'. Thi~ cotztintaon stretches from rote learning, through carefully-g,ided concept-fon~ation by obsert'ation, ot~t toward independent theory formation. Six)'ears ago. the ,~',t program was constructed as an experiment in this latter kind of leanffng by discot'ery, hs source of I~);~er ~as a large body of heuristics, rules which guhled it toward fruitful topics of int'estigation, toward profitable experiments to perform, toward platt~ible hypotheses and definitions. Since that time, we hate gained a deeper itt~ight into the nature of heuristics and the nature of the process of forming and extending theories empirically. "The Natttre of llettristics I" paper presented the theoretical basig for this work, with on emphasis on how heuristics relate to each other. This paper present.~ our accretion model of theory formation, and git'es many exatnple.~ of it.~ use in producing new discoveries in t'arious field~. These examples are drawn ]'rom runs of a program called Eur~ts~.o, the successor to AM. that embodies the accretion tnodel and uses a corptt~ of heuristics to guide its behat'ior. Since our tnodel demands the ability to discoter new heuristics periodically as well a~ new domain objects and operators, some of oar examples illustrate that process as well. "The Nature of ileuristics Ill" paper describes the architecture of the EURISKO program, and conchtsiot~ we hate made front its behar'ior. This paper deals with learning, by which we intend to include all processes which result in accretion of knowledge. Scction 1 surveys the spcctrum of learning, from rote memorization to more complex activities. Section 2 focuses on the far end of the learning spectrum, inductive inference. Section 3 proposes a model for the far end of that activity, empirical theory formation. That model accounts for the discovery of new heuristics as well as new task-specific objects and operations. Finally, Section 4 presents dozens of examples of the model in action, producing discovcrics in many different fields. The next paper in this

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A heuristic approach for multi-stage sequence-dependent group scheduling problems

We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...

متن کامل

A Novel Adapted Multi-objective Meta-heuristic Algorithm for a Flexible Bi-objective Scheduling Problem Based on Physics Theory

  We relax some assumptions of the traditional scheduling problem and suggest an adapted meta-heuristic algorithm to optimize efficient utilization of resources and quick response to demands simultaneously. We intend to bridge the existing gap between theory and real industrial scheduling assumptions (e.g., hot metal rolling industry, chemical and pharmaceutical industries). We adapt and evalua...

متن کامل

A novel heuristic algorithm for capacitated vehicle routing problem

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...

متن کامل

PSEUDO-RANDOM DIRECTIONAL SEARCH: A NEW HEURISTIC FOR OPTIMIZATION

Meta-heuristics have already received considerable attention in various fields of engineering optimization problems. Each of them employes some key features best suited for a specific class of problems due to its type of search space and constraints. The present work develops a Pseudo-random Directional Search, PDS, for adaptive combination of such heuristic operators. It utilizes a short term...

متن کامل

CONFIGURATION OPTIMIZATION OF TRUSSES USING A MULTI HEURISTIC BASED SEARCH METHOD

Different methods are available for simultaneous optimization of cross-section, topology and geometry of truss structures. Since the search space for this problem is very large, the probability of falling in local optimum is considerably high. On the other hand, different types of design variables (continuous and discrete) lead to some difficulties in the process of optimization. In this articl...

متن کامل

Formation of manufacturing cell using queuing theory and considering reliability

In this paper, a stochastic cell formation problem is studied using queuing theory framework and considering reliability. Since cell formation problem is NP-Hard, two algorithms based on genetic and modified particle swarm optimization (MPSO) algorithms are developed to solve the problem. For generating initial solutions in these algorithms, a new heuristic method is developed, which always cre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Artif. Intell.

دوره 21  شماره 

صفحات  -

تاریخ انتشار 1983